基于知识的模型表示研究

基于知识的模型表示是信息管理系统,特别是决策支持系统(DSS)的基础。根据模型管理和模型建立动态性原则的要求,提出了模型知识化的框架表示法,并给出了应用实例。     

熵权正负理想方案灰色关联法的对地攻击目标选择

针对攻击机对地攻击的目标选择问题,提出了目标攻击优先权的计算方法,将正负理想方案与灰色关联分析方法进行融合并引进熵权的思想为各项优先权赋值,避免了权值确定过于主观的问题,提出了一种目标选择的模型,为飞行员对地攻击目标选择提供了辅助决策,具有较高的实用性。仿真结果也说明了该方法的合理性。     

基于运载能力评估的固体运载火箭推力向量控制方案比较

从对运载能力影响角度开展固体运载火箭发动机推力向量控制系统比较分析研究。设计了三种采用不同发动机推力向量控制系统的多级固体运载火箭方案,将增广乘子法与共轭方向法相结合,对固体运载火箭上升段弹道进行了优化设计,给出运载能力评估结果。研究表明,起飞质量均为50 000kg,目标轨道均为300km太阳同步轨道时,采用栅格舵和侧喷流作为推力向量控制系统方案,比采用燃气舵和侧喷流作为推力向量控制系统方案,运载能力提高70kg,比各级固体发动机全部采用摆动喷管控制方案,运载能力提高115kg,为固体运载火箭总体方案论证提供理论依据。     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

SPH并行计算方案及其在自由表面流动模拟中的应用

针对光滑粒子动力学主要计算量是近邻粒子搜索这一特点,提出了一种基于粒子分解的光滑粒子动力学并行计算方案。利用该方案可以方便地将任意串行光滑粒子动力学代码并行计算,而且每一个时间步内的信息传递量只和粒子总数有关,而和粒子的分布无关,因而特别适合于自由表面流动等大变形问题的并行数值模拟。对一个粒子总数为40万的三维溃坝问题的模拟结果表明:此方案能达到的最大加速比约为16,这一结果可能比空间分解方案(不考虑动态负载均衡)更优。     

基于微分平坦的高超声速滑翔飞行器轨迹规划

针对高超声速滑翔飞行器再入轨迹规划问题,提出了一种基于微分平坦理论的三自由度轨迹生成方法。在分析纵向运动简化模型的微分平坦属性基础上,将纵向参考轨迹规划问题映射到平坦输出空间,消除微分动力学约束的同时降低系统设计的维数,进而提高求解效率;采用全局插值多项式参数化平坦输出函数,将问题转换为非线性规划问题求解;设计比例-微分反馈控制律跟踪纵向参考轨迹,同时采用航向角误差走廊控制侧向运动,实现三自由度轨迹生成。仿真分析表明所提出的方法能够较快生成满足多种约束且性能优化的飞行轨迹。     

Multidirectional scheduling scheme in resource‐constrained project schedulingproblem

In 2000, Klein showed that bidirectional scheduling schemes (bidss) outperform single‐directional scheduling schemes (e.g., forward or backward schemes). In 2010, Yoosefzadeh, et al. [J Math Model Algor 9 (2010), 357–373] showed that depending on the nature of the problems and also the type of priority rules used, schedules produced by a so‐called tridirectional scheduling scheme (trdss) yields shorter makespans when compared to forward, backward, and even bidss. Since the justification technique is applied in many of the state‐of‐the‐art algorithms nowadays, we show that the tuned version of the trdss outperforms the double justification technique. Moreover, we investigate the circumstances under which the trdss is more probable to generate schedules with shorter makespans. To this end, we introduce a new measure of resource requirements and their distributions, namely total amount of overflows. Our analytical as well as empirical investigations show that when the new measure is increased, it is more probable to obtain schedules with shorter makespans using the trdss. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 44–55, 2014     

应用压力间断解析解修正AUSM+-up格式

AUSM+-up格式是近年来发展的AUSM类格式,通过在对流通量中引入压力耗散,同时在压力通量中引入速度耗散,使之在各种马赫数下均有良好的收敛性和稳定性。然而,通过对格式的分析,我们发现当马赫数为零时,在压力间断位置会出现质量通量无穷大的非物理现象。为了克服这一缺陷,采用特征线法获得了压力间断问题的解析解;以此为基础,对对流通量中的压力耗散项进行修正,发展出新的AUSM+-up格式。以新的格式对不同速度驱动下的冲击波发展、不同强度压力间断问题和激波衍射问题进行了仿真,计算结果与理论解吻合得较好。     

基于群决策协同网络信息的掩护机编队选择

针对任务机群中掩护机编队的选择,用群决策协同网络信息模型进行了掩护机编队的选择。首先,给出了协同网络、模糊数和语言变量的相关概念;其次,分析了掩护机编队选择的指标体系框架和协同网络信息框架;然后,构建了群决策协同网络信息的数学模型,在此基础上,给出了方案选择的步骤;最后,运用该模型对掩护机编队的选择进行求解。结果表明：该模型能够综合群体专家的知识,解决掩护机编队选择中的定性判断问题。该模型可用于个体指标和协同指标均为定性指标时的方案优选问题。     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008